منابع مشابه
Register Allocation Via Coloring
-Register allocation may be viewed as a graph coloring problem. Each node in the graph stands for a computed quantity that resides in a machine register, and two nodes are connected by an edge if the quantities interfere with each other, that is, if they are simultaneously live at some point in the object program. This approach, though mentioned in the literature, was never implemented before. ...
متن کاملRegister Allocation via Hierarchical Graph Coloring
Register allocation is a vital stage in compiler optimization. It greatly impacts the effectiveness of other compiler optimization techniques. Graph coloring is the commonly used mechanism for register allocation. Since graph coloring is an NP-complete problem, heuristics are needed to find a practical solution. Several heuristics are available that perform well in practice. Commonly used heuri...
متن کاملRegister Allocation via Coloring of Chordal Graphs
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95% of the methods in the Java 1.5 library have chordal interference graphs when compiled with the JoeQ compiler. A greedy algorithm can optimally color a chordal graph in time linear in the number of edges,...
متن کاملRegister Windows vs. Register Allocation
A large register set can be exploited by keeping variables and constants in registers instead of in memory. Hardware register windows and compiletime or link-time global register allocation are ways to do this. A measure of the effectiveness of any of these register management schemes is how thoroughly they manage to remove loads and stores. This measure also must count extra loads and stores t...
متن کاملRegister Allocation via Chordal Graph Coloring for a HOT Compiler
[Note: this is an early draft of this write-up. A more polished version with citations and so forth is on the way shortly.] The problem of creating efficient type-preserving compilers for programming langauges with higherorder functions and rich type systems (HOT) has been studied with great interest in recent years, particularly at CMU. In Fall 2005, a course on HOT Compilation was offered for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1989
ISSN: 0362-1340,1558-1160
DOI: 10.1145/74818.74842